Enhanced Propositional Dynamic Logic for Reasoning
نویسندگان
چکیده
منابع مشابه
Enhanced Propositional Dynamic Logic for Reasoning about Concurrent Actions
Introduction This paper presents a work in progress on enhanced Propositional Dynamic Logics for reasoning about ac tions Propositional Dynamic Logics PDL s are modal logics for describing and reasoning about system dynamics in terms of properties of states and actions modeled as relations between states see Kozen Tiuryn Harel Parikh for surveys on PDL s see also Stirling for a somewhat di eren...
متن کاملA Propositional Dynamic Logic Approach for Order of Magnitude Reasoning
We introduce a Propositional Dynamic Logic for order of magnitude reasoning in order to formalize qualitative operations of sum and product. This new logic has enough expressive power to consider, for example, the concept of closeness, and to study some interesting properties for the qualitative operations, together with the logical definability of these properties. Finally, we show the applica...
متن کاملDynamic Logic for the Semantic Web
The propositional dynamic logic PDL is one of the most successful variants of modal logic; it plays an important role in many fields of computer science and artificial intelligence. As a logical basis for the W3C-recommended Web ontology language OWL, description logic provides considerable expressive power going far beyond propositional logic as while as the reasoning is still decidable. In th...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملFuzzy Propositional Formulas under the Stable Model Semantics
We define a stable model semantics for fuzzy propositional formulas, which generalizes both fuzzy propositional logic and the stable model semantics of classical propositional formulas. The syntax of the language is the same as the syntax of fuzzy propositional logic, but its semantics distinguishes stable models from non-stable models. The generality of the language allows for highly configura...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995